A Pre-Run-Time Scheduling Algorithm For Hard Real-Time Systems

In 1] a branch-and-bound implicit enumeration algorithm is described whose purpose is to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness deened as the diierence between the process completion time and deadline. We show in this correspondence that this algorithm does not always succeed in nding a feasible solution, and describe the reason why the algorithm might fail. Any opinions, ndings, and conclusions or recommendations are those of the authors and do not necessarily reeect the views of the funding agency.